var math/big.intOne

19 uses

	math/big (current package)
		int.go#L38: var intOne = &Int{false, natOne}
		int.go#L255: 	z.Set(intOne)
		int.go#L258: 		i.Add(&i, intOne)
		int.go#L308: 			z.Add(z, intOne)
		int.go#L310: 			z.Sub(z, intOne)
		int.go#L358: 			z.Add(z, intOne)
		int.go#L361: 			z.Sub(z, intOne)
		int.go#L916: 	if d.Cmp(intOne) != 0 {
		int.go#L959: 		if b.Cmp(intOne) == 0 {
		int.go#L999: 	e := new(Int).Add(p, intOne) // e = p + 1
		int.go#L1023: 	beta.Sub(beta, intOne)
		int.go#L1036: 	s.Sub(p, intOne)
		int.go#L1044: 		n.Add(&n, intOne)
		int.go#L1052: 	y.Add(&s, intOne)
		int.go#L1062: 		for t.Cmp(intOne) != 0 {
		intconv.go#L53: var _ fmt.Formatter = intOne // *Int must implement fmt.Formatter
		intconv.go#L231: var _ fmt.Scanner = intOne // *Int must implement fmt.Scanner
		rat.go#L64: 	z.b.Set(intOne)
		rat.go#L444: 		if f := NewInt(0).lehmerGCD(nil, nil, &z.a, &z.b); f.Cmp(intOne) != 0 {